Definitional Reasoning in Proof-Theoretic Semantics and the Square of Opposition

نویسنده

  • Peter Schroeder-Heister
چکیده

Within a framework of reasoning with respect to clausal definitions of atoms, four forms of judgement are distinguished: Direct and indirect assertion, and direct and indirect denial. Whereas direct assertion and direct denial are established by directly applying a definitional clause (“definitional closure”), indirect assertion and indirect denial result from showing that all possible premisses of the opposite judgement can be refuted (“definitional reflection”). The deductive relationships between these four forms of judgement correspond to those represented in the square of opposition, if direct assertion and direct denial are placed in the A and E corners, and indirect assertion and indirect denial in the I and O corners of the square.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof-Theoretic Semantics (SEP Entry)

3 Some versions of proof-theoretic semantics 6 3.1 The semantics of implications: Admissibility, derivability, rules . . . . . 6 3.1.1 Lorenzen’s operative logic . . . . . . . . . . . . . . . . . . . . . 6 3.1.2 Von Kutschera’s Gentzen semantics . . . . . . . . . . . . . . . . 7 3.1.3 Schroeder-Heister’s extension of natural deduction . . . . . . . . 7 3.2 The Semantics of derivations as based ...

متن کامل

Argumentation-Based Proof Procedures for Credulous and Sceptical Non-monotonic Reasoning

We define abstract proof procedures for performing credulous and sceptical non-monotonic reasoning, with respect to the argumentation-theoretic formulation of non-monotonic reasoning proposed in [1]. Appropriate instances of the proposed proof procedures provide concrete proof procedures for concrete formalisms for non-monotonic reasoning, for example logic programming with negation as failure ...

متن کامل

Supporting Reasoning about Functional Programs: An Operational Approach

Some existing systems for supporting reasoning about functional programs have been constructed without first formalising the semantics of the language. This paper discusses how a reasoning system can be built, within the HOL theorem proving environment, based on an operational semantics for the language and using a fully definitional approach. The theoretical structure of the system is based on...

متن کامل

Argumentation-theoretic proof procedures for default reasoning

We present a succession of presentations of an argumentation-theoretic proof procedure that applies uniformly to a wide variety of logics for default reasoning, including Theorist, default logic, logic programming, autoepistemic logic, non-monotonic modal logic and certain instances of circumscription. The proof procedure can be viewed as conducting a dispute, which is a sequence of alternating...

متن کامل

ar X iv : c s . L O / 0 20 70 86 v 1 2 5 Ju l 2 00 2 A Model - Theoretic Semantics for Defeasible Logic ⋆

Defeasible logic is an efficient logic for defeasible reasoning. It is defined through a proof theory and, until now, has had no model theory. In this paper a model-theoretic semantics is given for defeasible logic. The logic is sound and complete with respect to the semantics. We also briefly outline how this approach extends to a wide range of defeasible logics.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008